Collusion-Resilient Truly Combinatorial Auctions, Player-Knowledge Benchmarks, and Equilibrium-Less Solution Concepts
نویسنده
چکیده
We put forward a new mechanism achieving a high benchmark for (both revenue and) the sum of revenue and efficiency in truly combinatorial auctions. Notably, our mechanism guarantees its performance • in a very adversarial collusion model; • for any profile of strategies surviving the iterated elimination of dominated strategies; and • by leveraging the knowledge that the players have about each other (in a non-Bayesian setting). Our mechanism also is computationally efficient, and preserves the players’ privacy to an unusual extent.
منابع مشابه
New Resiliency in Truly Combinatorial Auctions (and Implementation in Surviving Strategies)
Following Micali and Valiant [MV07.a], a mechanism is resilient if it achieves its objective without any problem of (1) equilibrium selection and (2) player collusion. To advance resilient mechanism design, • We put forward a new meaningful benchmark for the combined social welfare-revenue performance of any mechanism in truly combinatorial auctions. • We put forward a new notion of implementat...
متن کاملResilient Mechanisms For Truly Combinatorial Auctions
Dominant-strategy truthfulness is traditionally considered the best possible solution concept in mechanism design, as it enables one to predict with confidence which strategies independent players will actually choose. Yet, as with any other form of equilibrium, it too can be extremely vulnerable to collusion. The problem of collusion is particularly evident for unrestricted combinatorial aucti...
متن کاملResilient Knowledge-Based Mechanisms For Truly Combinatorial Auctions (And Implementation in Surviving Strategies)
We put forward a new mechanism achieving a high benchmark for (both revenue and) the sum of revenue and efficiency in truly combinatorial auctions. Notably, our mechanism guarantees its performance • in a very adversarial collusion model; • for any profile of strategies surviving the iterated elimination of dominated strategies; and • by leveraging the knowledge that the players have about each...
متن کاملCollusion, efficiency, and dominant strategies
Green and Laffont [1] have proven that no collusion-resilient dominant-strategy mechanism guarantees efficiency in multi-unit auctions if a player is allowed to report only a single valuation. Chen and Micali [2] have bypassed this impossibility by slightly enlarging the strategy spaces, but via mechanisms that can impose impractically high fines. For unrestricted combinatorial auctions, the po...
متن کاملCollusion-Resilient Revenue In Combinatorial Auctions
In auctions of a single good, the second-price mechanism achieves, in dominant strategies, a revenue benchmark that is naturally high and resilient to any possible collusion. We show how to achieve, to the maximum extent possible, the same properties in combinatorial auctions. ∗This Technical Memo improves on material submitted to FOCS 2007, SODA 2008, and the Library of Congress. 1 The Problem...
متن کامل